Debtor level collection operations using Bayesian dynamic programming
نویسندگان
چکیده
منابع مشابه
Cost Analysis of Acceptance Sampling Models Using Dynamic Programming and Bayesian Inference Considering Inspection Errors
Acceptance Sampling models have been widely applied in companies for the inspection and testing the raw material as well as the final products. A number of lots of the items are produced in a day in the industries so it may be impossible to inspect/test each item in a lot. The acceptance sampling models only provide the guarantee for the producer and consumer that the items in the lots are acco...
متن کاملcost analysis of acceptance sampling models using dynamic programming and bayesian inference considering inspection errors
acceptance sampling models have been widely applied in companies for the inspection and testing the raw material as well as the final products. a number of lots of the items are produced in a day in the industries so it may be impossible to inspect/test each item in a lot. the acceptance sampling models only provide the guarantee for the producer and consumer that the items in the lots are acco...
متن کاملVery High Level Programming with Collection Components
Despite the possibility of providing standard collection frameworks, object-oriented languages do not generally encourage a 'very high level' style of programming in which collection components are regarded as first class citizens and in which different implementations for a collection can be exchanged without affecting the correctness of a program and with minimal change to the source code. Th...
متن کاملBayesian Real-Time Dynamic Programming
Real-time dynamic programming (RTDP) solves Markov decision processes (MDPs) when the initial state is restricted, by focusing dynamic programming on the envelope of states reachable from an initial state set. RTDP often provides performance guarantees without visiting the entire state space. Building on RTDP, recent work has sought to improve its efficiency through various optimizations, inclu...
متن کاملApproximate dynamic programming for rail operations
Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled using classical math programming models defined over space-time networks. Even simplified models can be hard to solve, requiring the use of various heuristics. We show how to combine math programming and simulation in an ADP-f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operational Research Society
سال: 2019
ISSN: 0160-5682,1476-9360
DOI: 10.1080/01605682.2018.1506557